Computational Benefits of a Totally Lexicalist Grammar

نویسندگان

  • Katalin Balogh
  • Judit Kleiber
چکیده

In this paper we demonstrate the computational benefits of a radically lexicalist generative grammar. We have developed a Prolog-parser on the basis of the new approach of Totally Lexicalist Morphology (TLM), which is developed out of Generative Argument Structure Grammar (GASG; [2]), a new and radical version of lexicalist generative grammar (in the spirit of e.g. Karttunen [5]). The parser decides the grammaticality of Hungarian sentences, and creates their (practically English) DRSs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The GeLexi MT Project

Our double Machine (-Aided) Translation project to be demonstrated here (sections 3-4) is based on the parsing project [5-9, 12] of our Pécs theoretical and computational linguistics research team, called GeLexi (‘Generative LEXIcon’), whose (knowledge-based) parsers (section 2) rely on “totally lexicalist” [21, 2, 4, 7] representative mini-grammars of English and the (morphologically very rich...

متن کامل

Determining Internal and External Indices for Chart Generation

This paper presents a compilation procedure which determines internal and external indices for signs in a unification based grammar to be used in improving the computational efficiency of lexicalist chart generation. The procedure takes as input a grammar and a set of feature paths indicating the position of semantic indices in a sign, and calculates the fixed-point of a set of equations derive...

متن کامل

The Construct PREDICATE: Empirical arguments and theoretical status

The past few years have witnessed increased attention within lexicalist frameworks such as Lexical Functional Grammar (LFG) and Head Driven Phrase Structure Grammar (HPSG) to the analysis of predicates expressed by syntactically independent pieces. The recognition of such phenomena, primarily represented in the literature by analytic or periphrastic causatives, raises central questions concerni...

متن کامل

What feature co-occurrence restrictions have to do with type signatures

Computational linguistics of the last quarter century has seen the development of a hierarchical and lexicalist treatment of linguistic information. In the course of this development, formal constraints which were stated in GPSG in terms of feature co-occurrence restrictions came to be formulated within HPSG in terms of type hierarchies, but the relations between these descriptive devices has r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003